New search direction of steepest descent method for solving large linear systems

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

A METHOD FOR SOLVING FUZZY LINEAR SYSTEMS

In this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. Also necessary and sufficient conditions for existenceof solution are given. Some numerical examples illustrate the efficiencyof the method.

Steepest descent method for solving zero-one nonlinear programming problems

In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution. 2007 Elsevier Inc. All rights reserved.

Defuzzification method for solving fuzzy linear systems

The steepest descent gravitational method for linear programming

We present a version of the gravitational method for linear programming, based on steepest descent gravitational directions. Finding the direction involves a special small “nearest point problem” that we solve using an efficient geometric approach. The method requires no expensive initialization, and operates only with a small subset of locally active constraints at each step. Redundant constra...